pushdown automaton - translation to russian
Diclib.com
ChatGPT AI Dictionary
Enter a word or phrase in any language 👆
Language:

Translation and analysis of words by ChatGPT artificial intelligence

On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:

  • how the word is used
  • frequency of use
  • it is used more often in oral or written speech
  • word translation options
  • usage examples (several phrases with translation)
  • etymology

pushdown automaton - translation to russian

TYPE OF AUTOMATON
Push-down automaton; Pushdown automata; Stack automaton; Push-Down Automaton; Push-down automata; Push Down Automaton; Push down automaton; Pushdown autonoma; Pushdown transducer; Pushdown Transducer; Two-Stack Push Down Automaton; Nondeterministic pushdown automaton; Pushdown stack

pushdown automaton         

математика

автомат с магазинной памятью

магазинный автомат

stack automaton         

математика

магазинный автомат

push-down automaton         
магазинный автомат, автомат с магазинной памятью

Definition

cellular automaton
<algorithm, parallel> (CA, plural "- automata") A regular spatial lattice of "cells", each of which can have any one of a finite number of states. The state of all cells in the lattice are updated simultaneously and the state of the entire lattice advances in discrete time steps. The state of each cell in the lattice is updated according to a local rule which may depend on the state of the cell and its neighbors at the previous time step. Each cell in a cellular automaton could be considered to be a finite state machine which takes its neighbours' states as input and outputs its own state. The best known example is J.H. Conway's game of Life. {FAQ (http://alife.santafe.edu/alife/topics/cas/ca-faq/ca-faq.html)}. Usenet newsgroups: news:comp.theory.cell-automata, news:comp.theory.self-org-sys. (1995-03-03)

Wikipedia

Pushdown automaton

In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.

Pushdown automata are used in theories about what can be computed by machines. They are more capable than finite-state machines but less capable than Turing machines (see below). Deterministic pushdown automata can recognize all deterministic context-free languages while nondeterministic ones can recognize all context-free languages, with the former often used in parser design.

The term "pushdown" refers to the fact that the stack can be regarded as being "pushed down" like a tray dispenser at a cafeteria, since the operations never work on elements other than the top element. A stack automaton, by contrast, does allow access to and operations on deeper elements. Stack automata can recognize a strictly larger set of languages than pushdown automata. A nested stack automaton allows full access, and also allows stacked values to be entire sub-stacks rather than just single finite symbols.

What is the Russian for pushdown automaton? Translation of &#39pushdown automaton&#39 to Russian